next node
英 [nekst nəʊd]
美 [nekst noʊd]
网络 下一个节点; 下一节点
双语例句
- Due to partial parsing the message tree will not be parsed completely and the message will be routed to next node.
由于对消息树进行部分解析时并不会完全解析，因此消息将路由到下一个节点。 - Passing: jump indicates that iteration should jump to the next node and skip all remaining visitors for this node.
传递：jump表示迭代应跳转到下一个节点，并跳过此节点的所有剩余访问者。 - Processing is handled the same way: Non-heading nodes are placed in the output, and the utility advances to the next node.
处理方式也与第一种模式相同：将非标题节点放到输出中，然后前进到下一个节点。 - This next child node, in our case, is the result of applying a guess.
在我们的示例中，下一个子节点就是应用猜测后得出的节点。 - The fix is reasonably simple: Don't store the next node.
纠正方法相当简单：不存储下一个节点。 - It also has a method to determine the next child node to consider after backtracking.
它还使用一种方法判断在返回后下一个要进行猜测的子节点。 - Similarly, it is useful to create visitors that can check for cases that should cause skipping to the next node or aborting the iteration completely.
与此相似，创建能够检查将导致跳转到下一个节点或彻底取消迭代的情况的访问者也是非常有用的。 - To determine the sum of the rest of the list, we call this function again with the next node.
为了确定列表其余部分的和，我们针对下一个节点来调用这个函数。 - In the DOM, it isn't always easy to tell which is the next node in document order.
DOM通常很难告诉您，按照文档的顺序，下一个节点是什么。 - To retrieve the next node of a list, you need to use the function cdr.
为了获得列表的下一个节点，您需要使用cdr函数。 - The next node is a Compute node named Length Processing, which interprets the first four bytes of the message data.
下一个节点是名称为LengthProcessing的Compute节点，它将对消息数据的前四个字节进行解释。 - This function returns an anonymous visitor function that will jump to the next node if the node is not of the correct type.
此函数返回一个匿名访问者函数，如果节点的类型不正确，则该函数将跳转到下一个节点。 - The zip/ next call iterates to the next node in a depth-first walk through the tree.
在深度优先的树遍历中，zip/next调用将迭代至下一个节点。 - The arrows in this diagram represent pointers to the location of the next node in memory.
图中的箭头表示指向内存中下一个节点位置的指针。 - Here you have a struct that includes the first element as a data item and the second element as a pointer to the next node.
这样您就拥有了一个struct，其中第一个元素为数据条目，第二个元素为指向下一个节点的指针。 - End handler waits until all child tokens are completed and then transitions to the next node.
End处理器等待所有的子令牌完成，然后transition到下个节点。 - The local name of the next sibling node to move to.
要移动到的下一个同级节点的本地名称。 - In accordance with different destination nodes of user data, routing nodes will choose its next routing node based on this value.
路由节点将根据用户数据的不同目的节点，依据此值为其选择下一个行程节点。 - So, in the example below, we have a function that checks the node type of the next sibling node.
在下面的案例中，我们将书写一个用于检测下一个同属节点的节点类型的函数。 - We then move to the next node on the decision tree. ( Fancy MBA talk, no?)
然后我们转到决策树（DecisionTree）的下一个节点（复杂的MBA说法，不是吗？）。 - This algorithm employs probes to search feasible paths in parallel, and uses heuristic functions to randomly select a suitable next node.
算法采用探测包并行地搜索可行路径，并使用启发式函数随机选择下一跳节点。 - The new strategy is that the next node ( optimal node) is choice by the former node with the real-time data in routing delay, which is different from the original node-control algorithm.
该算法的路径选择策略不是采用源节点控制算法，而是依据路由中所得到的时延实测值，由各节点独立地选择下一个节点（最佳节点）。 - Thirdly, the platform transmits data to next node through the best link according to the route-choosing algorithm.
第三，此平台通过路由选择算法得出最优链路来将信息和数据及时地转发到下一节点。 - Aiming at ACA's defects, the strategy to select the next node was improved; crossover and mutation in GAs were introduced in, so the search space was opened up.
并分析了基本蚁群算法的不足，在移动选择策略上进行了改进，且借鉴了遗传算法中的交叉、变异增加了解的多样性，拓展了搜索空间。 - At the routing process, the resources or the massages are routed to the next node which is physical adjacent to this node in order to reduce the routing overhead.
路由过程中，节点优先选择物理邻接的节点进行路由，减少了路由开销。 - When choosing the next node, each ant imports the probability of selection that has been introduced in the last to accelerate the search speed.
每只蚂蚁在选择下一节点时引入该路径上次被搜索时的选择概率，加快搜索速度。 - According to the new routing strategy with a single tunable parameter, a packet is delivered to next node with probability that depends not only on the degree of the next node but also the estimated waiting time at the node.
根据新的路由策略，数据包在选择下一节点时，要同时考虑所选择节点度的大小和在该节点的等待时间。 - This method utilizes the minimum gradient to choose the next node during the migrating of MA. The calculation of gradient combines the information effectiveness measurement with energy cost.
该方法利用最小梯度来选择移动代理迁移的下一跳节点，梯度的计算综合考虑了了对下一跳候选节点的信息效益测度估计和能量代价计算。 - Opportunistic routing, one of them, gives a new way to solve the problem in WMN by breaking the traditional "Next Node" mode. Opportunistic routing increases the spatial frequency spectrum utilization and system throughput.
机会路由作为其中的一种，打破了传统的下一跳传输模式，通过转发节点集合的新传输模式提高空间频谱利用率，增大了网络的吞吐量。 - And so on, according to network, the packet can be continued routing to the nearest next node for transmission, until it reaches the final destination.
依此类推，数据流量还可以根据网络的情况，继续路由到与之最近的下一个节点进行传输，直到到达最终目的地。